nLab computational type theory

Idea

The term computational type theory has been used

1. generally for intuitionistic type theory in view of its computational content via the propositions-as-types and proofs-as-programs interpretation (e.g. Constable 02, Scholarpedia).

2. more specifically for intuitionistic type theory with inductive types and here specifically for the dialect of the language which is implemented in the NuPRL software (Constable et al. 86, NuPRL 05);

   Constable, p. 6: $[$computational type theory$]$ considerably extended Per Martin-Löf’s Intuitionistic Type Theory (ITT) adding set types, quotient types, recursive types, partial object types (bar types)

3. for modal type theory, specifically for type theory equipped with a monad (in computer science) that preserves finite products, which exhibits a kind of computation (Benton-Bierman-de Paiva 93, Fairtlough-Mendler 02).

   The internal logic of computational type theory in this sense is also called propositional lax logic (Fairtlough-Mendler 97, Crolard) or computational logic.

Related concepts

• computational trinitarianism

References

Discussion of intuitionistic/constructive type theory (with inductive types) as such referred to as computational type theory is in

• Scholarpedia, Computational type theory

• Robert Constable, Naïve Computational Type Theory, Proof and System-Reliability NATO Science Series Volume 62, 2002, pp 213-259

Discussion specifically in the context of NuPRL is in

• Robert Constable, Stuart F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, NJ, 1986.

• Innovations in Computational Type Theory using Nuprl (pdf)

• Robert Constable, The Triumph of Types: Creating a Logic of Computational Reality (pdf)

Discussion in the sense of modal type theory where computation is exhibited by a monad (in computer science) is in

• Matt Fairtlough, Michael Mendler, Propositional Lax Logic, Volume 137, Issue 1, 25 August 1997, Pages 1–33 (pdf)

• Nick Benton, Gavin Bierman, Valeria de Paiva, Computational Types from a Logical Perspective, Journal of Functional Programming 8 2 (1998) 177-193 [doi:10.1017/S0956796898002998, web]

• Matt Fairtlough, Michael Mendler, On the Logical Content of Computational Type Theory: A Solution to Curry’s Problem, Types for Proofs and Programs, Lecture Notes in Computer Science Volume 2277, 2002, pp 63-78 (pdf)

• Tristan Crolard, Monadic reflection in lax logic pdf

See also

• Fairouz Kamareddine, Twan Laan and Robert Constable (2012) Russell’s Orders in Kripke’s Theory of Truth and Computational Type Theory. In Dov. M Gabbay, Akihiro Kanamori and John Woods, (editors) Sets and Extensions in the Twentieth Century, 6, HHL, : San Diego: North Holland, 2012, pp. 801-845.